De ning and Measuring Con icts in Optimistic Replication
نویسندگان
چکیده
Optimistic replication is often viewed as essential for large scale systems and for supporting mobile computing. In optimistic replication, updates can be made concurrently to di erent le replicas, resulting in multiple versions of the le. To recover from these con icting updates, after-the fact con ict resolution actions are required to recombine multiple versions into one. This paper de nes these concepts and discusses approaches to measure them in optimistically replicated systems. Measurement of the number of con icting updates and con ict resolution is important to judge the practicality of optimistic replication. An environment where con icting updates are frequent will not be attractive since users cannot assume they have up-to-date data. Although many con icts can be automatically resolved, some con icts require user intervention; such con icts cannot be too common. This paper shows an approach to measure the number of con icting updates. From this measurement we derive the actual amount of work done by the user or system to resolve con icts and the minimum amount of work required to resolve con icts.
منابع مشابه
Discovering and Reconciling Semantic Con icts: A Data Mining Perspective
Current approaches to semantic interoperability require human intervention in detecting potential con icts and in de ning how those con icts may be resolved. This is a major impedance to achieving \logical connectivity", especially when the number of disparate sources is large. In this paper, we demonstrate that the detection and reconciliation of semantic con icts can be automated using tools ...
متن کاملTimeliness via Speculation for Real-Time Databases
Various concurrency control algorithms di er in the time when con icts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency Control (PCC and OCC) alternatives represent two extremes. PCC locking protocols detect con icts as soon as they occur and resolve them using blocking. OCC protocols detect con icts at transaction commit time and resol...
متن کاملSemantic Interoperability through Context Interchange: Representing and Reasoning about Data Con icts in Heterogeneous and Autonomous Systems
This paper describes a strategy for the construction of large-scale heterogeneous systems which combines the bene ts of both tight-coupling systems (insulating users from the complexity of semantic heterogeneity thus promoting greater usability) and loose-coupling systems (allowing changes in individual components to be contained locally thus assuring the long-term viability of the system as a ...
متن کاملConflict free transaction scheduling using serialization graph for real-time databases
A best eort approach to data scheduling, such as optimistic concurrency control in real-time database systems (RTDBS), imposes a heavy burden on the systems by restarting con ̄icting transactions. The restarted transactions themselves may miss their deadlines and the resources consumed by them may be wasted. Hence it can be better to schedule transactions such that only con ̄ict free transaction...
متن کاملIncompatibility Domain Definition Incompatibility Entity Definition Incompatibility Data Value Incompatibility Abstraction Level Incompatibility Schematic
In a multidatabase system schematic con icts between two objects are usually of inter est only when the objects have some semantic a nity In this paper we try to reconcile the two perspectives We rst de ne the concept of semantic proximity and provide a semantic taxonomy We then enumerate and classify the schematic and data con icts We discuss possible semantic similarities between two objects ...
متن کامل